Learning Continuous Implicit Representation for Near-Periodic Patterns

نویسندگان

چکیده

AbstractNear-Periodic Patterns (NPP) are ubiquitous in man-made scenes and composed of tiled motifs with appearance differences caused by lighting, defects, or design elements. A good NPP representation is useful for many applications including image completion, segmentation, geometric remapping. But representing challenging because it needs to maintain global consistency (tiled layout) while preserving local variations (appearance differences). Methods trained on general using a large dataset single-image optimization struggle satisfy these constraints, methods that explicitly model periodicity not robust detection errors. To address challenges, we learn neural implicit coordinate-based MLP single optimization. We an input feature warping module periodicity-guided patch loss handle both variations. further improve the robustness, introduce proposal search use multiple candidate periodicities our pipeline. demonstrate effectiveness method more than 500 images building facades, friezes, wallpapers, ground, Mondrian patterns multi-planar scenes.KeywordsNear-periodic patternsNeural representationSingle

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implicit Learning of Lexical Stress Patterns

The possibility of implicit learning (i.e. learning without intention or awareness) of prosodic features has been little investigated, despite a great deal of studies in other areas of language. We tested whether a lexical stress pattern could be implicitly learned after short exposure. We found that English-speaking subjects showed learning of the Spanish-based lexical stress patterns from the...

متن کامل

Strong convergence of a general implicit algorithm for variational inequality problems and equilibrium problems and a continuous representation of nonexpansive mappings

We introduce a general implicit algorithm for finding a common element of‎ ‎the set of solutions of systems of equilibrium problems and the set of common fixed points‎ ‎of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings‎. ‎Then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...

متن کامل

Near-Resonant Steady Mode Interaction: Periodic, Quasi-periodic, and Localized Patterns

Motivated by the rich variety of complex periodic and quasi-periodic patterns found in systems such as two-frequency forced Faraday waves, we study the interaction of two spatially periodic modes that are nearly resonant. Within the framework of two coupled one-dimensional Ginzburg-Landau equations we investigate analytically the stability of the periodic solutions to general perturbations, inc...

متن کامل

Learning topographic representation for multi-view image patterns

In 3D object detection and recognition, the object of interest in an image is subject to changes in view-point as well as illumination. It is benifit for the detection and recognition if a representation can be derived to account for view and illumination changes in an effective and meaningful way. In this paper, we propose a method for learning such a representation from a set of un-labeled im...

متن کامل

Idest: Learning a Distributed Representation for Event Patterns

This paper describes IDEST, a new method for learning paraphrases of event patterns. It is based on a new neural network architecture that only relies on the weak supervision signal that comes from the news published on the same day and mention the same real-world entities. It can generalize across extractions from different dates to produce a robust paraphrase model for event patterns that can...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-19784-0_31